PAC Learning Constraint Dependency Grammar Constraints

نویسندگان

  • Mary P. Harper
  • Christopher M. White
  • Stephen A. Hockema
  • Randall A. Helzerman
چکیده

Constraint Dependency Grammar (CDG) 11, 13] is a constraint-based grammatical formalism that has proven eeective for processing English 5] and improving the accuracy of spoken language understanding systems 4]. However, prospective users of CDG face a steep learning curve when trying to master this powerful formalism. Therefore, a recent trend in CDG research has been to try to ease the burden of grammar writers by developing methods for automatically learning CDG grammars from annotated sentences 22, 23]. In this paper, we prove that CDG grammar constraints are PAC learnable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling Dependency Grammar with Restricted Constraints

In this paper, parsing with dependency grammar is modeled as a constraint satisfaction problem. A restricted kind of constraints is proposed, which is simple enough to be implemented efficiently, but which is also rich enough to express a wide variety of grammatical well-formedness conditions. We give a number of examples to demonstrate how different kinds of linguistic knowledge can be encoded...

متن کامل

Approaches for Learning Constraint Dependency Grammar from Corpora

This paper evaluates two methods of learning constraint dependency grammars from corpora: one uses the sentences directly and the other uses subgrammar expanded sentences. Learning curves and test set parsing results show that grammars generated directly from sentences have a low degree of parse ambiguity but at a cost of a slow learning rate and less grammar generality. Augmenting these senten...

متن کامل

Writing Weighted Constraints for Large Dependency Grammars

Implementing dependency grammar as a set of defeasible declarative rules has fundamental advantages such as expressiveness, automatic disambiguation, and robustness. Although an implementation and a successful large-scale grammar of German are available, so far the construction of constraint dependency grammars has not been described at length. We report on techniques that were used to write th...

متن کامل

Enhanced Constraint Dependency Grammar Parsers

Constraint Dependency Grammar CDG is a constraint based grammatical formalism that has a weak generative capacity beyond context free gram mars and supports a very exible parsing algorithm for working with feature grammars however the running time of the parser is O n Hence we have investi gated how to improve the running time of the parser by applying feature constraints di erentially and by u...

متن کامل

USAEnhanced Constraint Dependency Grammar Parsers

Constraint Dependency Grammar (CDG) is a constraint-based grammatical formalism which has a weak generative capacity beyond context-free grammars and supports a very exible parsing algorithm for working with feature grammars; however, the running time of the parser is O(n 4). Hence, we have investigated how to improve the running time of the parser by applying feature constraints diierentially ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007